Continuous methods for symmetric generalized eigenvalue problems
نویسندگان
چکیده
منابع مشابه
A New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملGeneralized inverse eigenvalue problems for symmetric arrow-head matrices
In this paper, we first give the representation of the general solution of the following inverse eigenvalue problem (IEP): Given X ∈ Rn×p and a diagonal matrix Λ ∈ Rp×p, find nontrivial real-valued symmetric arrow-head matrices A and B such that AXΛ = BX. We then consider an optimal approximation problem: Given real-valued symmetric arrow-head matrices Ã, B̃ ∈ Rn×n, find (Â, B̂) ∈ SE such that ‖Â...
متن کاملAn algorithm for symmetric generalized inverse eigenvalue problems
Using QR-like decomposition with column pivoting and least squares techniques, we propose a new and ecient algorithm for solving symmetric generalized inverse eigenvalue problems, and give its locally quadratic convergence analysis. We also present some numerical experiments which illustrate the behaviour of our algorithm. Ó 1999 Elsevier Science Inc. All rights reserved. AMS classi®cation: 65...
متن کاملA Model-Trust-Region Framework for Symmetric Generalized Eigenvalue Problems
A general inner-outer iteration for computing extreme eigenpairs of symmetric/positive-definite matrix pencils is proposed. The principle of the method is to produce a sequence of p-dimensional bases {Xk} that converge to a minimizer of a generalized Rayleigh quotient. The role of the inner iteration is to produce an “update” vector by (approximately) minimizing a quadratic model of the Rayleig...
متن کاملEfficiently preconditioned inexact Newton methods for large symmetric eigenvalue problems
Efficiently preconditioned inexact Newton methods for large symmetric eigenvalue problems L. Bergamaschi & A. Martínez a Department of Civil, Environmental and Architectural Engineering, University of Padua, via Trieste 63, 35100 Padova, Italy b Department of Mathematics, University of Padua, via Trieste 63, 35100 Padova, Italy Accepted author version posted online: 14 Apr 2014.Published online...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2008
ISSN: 0024-3795
DOI: 10.1016/j.laa.2007.08.034